def sum_numbers(num):
    print(num)

    # 递归出口
    if num == 1:
        return

    sum_numbers(num - 1)


def step(n):
    if n > 2:
        return step(n - 1) + step(n - 2)
    elif n == 1 or n == 2:
        return n  # 能走一步就一种，两步就两种


if __name__ == '__main__':
    # sum_numbers(5)
    for i in range(1, 11):  # 默认递归上限996次，有包可以解除限制
        print(step(i))
